Inversion of the Pieri formula for Macdonald polynomials
نویسندگان
چکیده
منابع مشابه
eb 2 00 4 Inversion of the Pieri formula for Macdonald polynomials
We give the explicit analytic development of Macdonald polynomials in terms of “modified complete” and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments for monomial, Jack and Hall–Littlewood symmetric functions. ∗The second author was fully supported by an APART fellowship of the Austrian Academy of Sciences...
متن کاملPieri-Type Formulas for the Nonsymmetric Macdonald Polynomials
In symmetric Macdonald polynomial theory the Pieri formula gives the branching coefficients for the product of the rth elementary symmetric function er(z) and the Macdonald polynomial Pκ (z). In this paper we give the nonsymmetric analogues for the cases r = 1 and r = n − 1. We do this by first deducing the the decomposition for the product of any nonsymmetric Macdonald polynomial Eη (z) with z...
متن کاملThe binomial formula for nonsymmetric Macdonald polynomials
The q-binomial theorem is essentially the expansion of (x − 1)(x − q) · · · (x − q) in terms of the monomials x. In a recent paper [O], A. Okounkov has proved a beautiful multivariate generalization of this in the context of symmetric Macdonald polynomials [M1]. These polynomials have nonsymmetric counterparts [M2] which are of substantial interest, and in this paper we establish nonsymmetric a...
متن کاملA combinatorial formula for Macdonald polynomials
Abstract. In this paper we use the combinatorics of alcove walks to give a uniform combinatorial formula for Macdonald polynomials for all Lie types. These formulas are generalizations of the formulas of Haglund-Haiman-Loehr for Macdonald polynoimals of type GLn. At q = 0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove...
متن کاملA Combinatorial Formula for Macdonald Polynomials
The Macdonald polynomials H̃μ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representation-theoretic means, but these results do not provide any purely combinatorial interpretation fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2006
ISSN: 0001-8708
DOI: 10.1016/j.aim.2005.03.009